Rewriting Queries over Summaries of Big Data Graphs
نویسندگان
چکیده
This short paper reports on the benefits that traversal queries over existing graph stores (such as RDF databases) can gain from a class of optimizations based on summaries. Summaries, also known as structural indexes, have been extensively covered in the literature (see [2] for a brief overview). Despite this, summary-based optimizations are not widely implemented. To make both graph traversal queries and summaries readily available in existing RDF stores, we have devised a translation that outputs SPARQL queries that execute over summaries directly represented in RDF. In what follows, we give an overview of our proposal, illustrate it with an example, and mention preliminary evaluation results on real-world data.
منابع مشابه
On Rewriting, Answering Queries in OBDA Systems for Big Data (Short Paper)
The project Optiqueaims at providing an end-to-end solution for scalable access to Big Data integration, were end users will formulate queries based on a familiar conceptualization of the underlying domain. From the users queries the Optique platform will automatically generate appropriate queries over the underlying integrated data, optimize and execute them. In this paper we discuss Optique’s...
متن کاملRewriting and Code Generation for Dataflow Programs
Nowadays, several data processing engines to analyze and query big data exist. In most of the cases, if users want to perform queries using these engines, the complete program has to be implemented in a supported programming language by the users themselves. This requires them to understanding both the programming language as well as the API of the platform and also learning how to control or e...
متن کاملScalable Ontological Query Processing over Semantically Integrated Life Science Datasets using MapReduce
To address the requirement of enabling a comprehensive perspective of life-sciences data, Semantic Web technologies have been adopted for standardized representations of data and linkages between data. This has resulted in data warehouses such as UniProt, Bio2RDF, and Chem2Bio2RDF, that integrate different kinds of biological and chemical data using ontologies. Unfortunately, the ability to pro...
متن کاملHiFun - A High Level Functional Query Language for Big Data Analytics
We present a high level query language, called HiFun, for defining analytic queries over big data sets, independently of how these queries are evaluated. An analytic query in HiFun is defined to be a wellformed expression of a functional algebra that we define in the paper. The operations of this algebra combine functions to create HiFun queries in much the same way as the operations of the rel...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کامل